The Ordered Gradual Covering Location Problem on a Network
نویسندگان
چکیده
منابع مشابه
The Ordered Gradual Covering Location Problem on a Network
In this paper we develop a network location model that combines the characteristics of ordered median and gradual cover models resulting in the Ordered Gradual Covering Location Problem (OGCLP). The Gradual Cover Location Problem (GCLP) was specifically designed to extend the basic cover objective to capture sensitivity with respect to absolute travel distance. Ordered Median Location problems ...
متن کاملGeneral form of a cooperative gradual maximal covering location problem
Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...
متن کاملHub Covering Location Problem under Gradual Decay Function
This paper developed a mathematical model framework using the single allocation strategy for hub covering location problem. The model encompassed the transportation time covering under gradual decay function. Within a certain transportation time for the origin and destination nodes among two hubs, the route is fully covered, and beyond another specified transportation time the route is not cove...
متن کاملA cross entropy algorithm for continuous covering location problem
Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance.This paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (MINLP) for covering location model.The model is solved to determine the best covering value.Also, this paper proposes aCross Entropy (CE) algorithm consider...
متن کاملHub Covering Location Problem Considering Queuing and Capacity Constraints
In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.08.003